Resource-Bound Quantification for Graph Transformation
نویسندگان
چکیده
منابع مشابه
Resource-Bound Quantification for Graph Transformation
Graph transformation has been used to model concurrent systems in software engineering, as well as in biochemistry and life sciences. The application of a transformation rule can be characterised algebraically as construction of a double-pushout (DPO) diagram in the category of graphs. We show how intuitionistic linear logic can be extended with resource-bound quantification, allowing for an im...
متن کاملNested Quantification in Graph Transformation Rules
In this paper we describe a way to integrate Taentzer’s rule amalgamation with the recently proposed notions of nested graph conditions. The resulting so-called quantified graph transformation rules include (universally and existentially) quantified sub-structures in a flexible way. This can be used for instance to specify a larger-step operational semantics, thus improving the scalability of g...
متن کاملModelling Flexible Human Resource Allocation by Stochastic Graph Transformation
In order for business process models to accurately capture the flexibility of human actors, we have to allow for flexible task management and role allocation. That means to take into account deadlines and escalation procedures, consider access rights, but allow temporary promotion and dynamic assignment of actors. In order to meet these requirements we will represent the configurations of a bus...
متن کاملAn Institution for Graph Transformation
The development of a denotational framework for graph transformation systems proved elusive so far. Despite the existence of many formalisms for modelling various notions of rewriting, the lack of an explicit, algebraic notion of “term” for describing a graph (thus different from the usual view of a graph as an algebra in itself) frustrated the efforts of the researchers. Resorting to the theor...
متن کاملGraph Transformation for Topology Modelling
In this paper we present meta-rules to express an infinite class of semantically related graph transformation rules in the context of pure topological modelling with G-maps. Our proposal is motivated by the need of describing specific operations to be done on topological representations of objects in computer graphics, especially for simulation of complex structured systems where rearrangements...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.22.2